منابع مشابه
Watermarking Graph Partitioning Solutions
Intellectual property protection (IPP) is becoming increasingly important as information is more quickly and easily accessible. This is particularly apparent in the semiconductor community, where extensive design and code reuse motivates a need for good IPP schemes. Graph partitioning is a critical optimization problem that has many applications, particularly in the semiconductor design process...
متن کاملGraph Partitioning and Graph Clustering
We present an overview over our graph partitioners KaFFPa (Karlsruhe Fast Flow Partitioner) and KaFFPaE (KaFFPa Evolutionary). KaFFPa is a multilevel graph partitioning algorithm which on the one hand uses novel local improvement algorithms based on max-flow and min-cut computations and more localized FM searches and on the other hand uses more sophisticated global search strategies transferred...
متن کاملEvolutionary Acyclic Graph Partitioning
Directed graphs are widely used to model data flow and execution dependencies in streaming applications. This enables the utilization of graph partitioning algorithms for the problem of parallelizing computation for multiprocessor architectures. However due to resource restrictions, an acyclicity constraint on the partition is necessary when mapping streaming applications to an embedded multipr...
متن کاملEngineering Graph Partitioning Algorithms
The paper gives an overview of our recent work on balanced graph partitioning – partition the nodes of a graph into k blocks such that all blocks have approximately equal size and such that the number of cut edges is small. This problem has numerous applications for example in parallel processing. We report on a scalable parallelization and a number of improvements on the classical multilevel a...
متن کاملn-Level Graph Partitioning
We present a multi-level graph partitioning algorithm based on the extreme idea tocontract only a single edge on each level of the hierarchy. This obviates the need for amatching algorithm and promises very good partitioning quality since there are veryfew changes between two levels. Using an efficient data structure and new flexible waysto break local search improvements early,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2002
ISSN: 0278-0070
DOI: 10.1109/tcad.2002.802277